Fundamental problems in provable security and cryptography
نویسندگان
چکیده
منابع مشابه
Fundamental problems in provable security and cryptography
This paper examines methods for formally proving the security of cryptographic schemes. We show that, despite many years of active research and dozens of significant results, there are fundamental problems which have yet to be solved. We also present a new approach to one of the more controversial aspects of provable security, the random oracle model.
متن کاملProvable Security in Cryptography
These lecture notes are a compilation of some of my readings while I was preparing two lectures given at EPFL on provable security in cryptography. They are essentially based on a book chapter from David Pointcheval called “Provable Security for Public Key Schemes” [24], on Victor Shoup’s tutorial on game playing techniques [30], on Coron’s Crypto’00 paper on the exact security of the Full Doma...
متن کاملProvable Security for Physical Cryptography
The modern approach to cryptography is provable security, where one defines a meaningful formal security model and proves that schemes are secure in this model. An exception is the design of countermeasures against cryptographic sidechannel attacks, which even today is mostly based on heuristic arguments, which only try to prevent particular attacks. It was long believed that side-channels are ...
متن کاملContributions to provable security and efficient cryptography
This thesis deals with two main matters of modern public key cryptography: provable security and efficient implementation. Indubitably, security is the most important property of any cryptographic scheme. Nevertheless, cryptographic algorithms have often been designed on a trial-and-error basis, i. e., a system has been regarded as secure as long as it withstood cryptanalytic attacks. In contra...
متن کاملSignatures in hierarchical certificateless cryptography: Efficient constructions and provable security
Recent years, lots of efforts have been devoted to construct secure schemes in certificateless cryptography which eliminates the key escrow problem in identity-based cryptography. However, most of them are designed in traditional certificateless cryptography which suffers from the single-point problem. Hierarchical cryptography exploits a practical security model to mirror the organizational hi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2006
ISSN: 1364-503X,1471-2962
DOI: 10.1098/rsta.2006.1895